String Operations Suggested by DNA Biochemistry: The Balanced Cut Operation
نویسندگان
چکیده
We introduce and investigate an operation with strings suggested by DNA processing (by means of exonucleases): the operation of cutting strings of equal length from the beginning and the end of a string. A related operation is that of cutting a square of a string from the preex of a string. The closure properties of families in the Chomsky hierarchy are investigated (and, with one exception, for the case of linear languages, settled).
منابع مشابه
Investigation of influential factors on well temperature for gas-liquid two-phase flow in under-balanced drilling operation
Analysis of the drilling fluid temperature due to heat transfer of drilling fluid with the formation in under-balanced drilling operation is the main objective of this study. Gas-liquid two-phase flow model considering thermal interaction with the formation is used to numerically simulate a well with real dimensions. In the present study, the continuity, momentum, and energy equations are devel...
متن کاملانتخاب کوچکترین ابر رشته در DNA با استفاده از الگوریتم ازدحام ذرّات
A DNA string can be supposed a very long string on alphabet with 4 letters. Numerous scientists attempt in decoding of this string. since this string is very long , a shorter section of it that have overlapping on each other will be decoded .There is no information for the right position of these sections on main DNA string. It seems that the shortest string (substring of the main DNA string) i...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملTwo complementary operations inspired by the DNA hairpin formation: Completion and reduction
We consider two complementary operations: Hairpin completion introduced in [D. Cheptea, C. Martin-Vide, V. Mitrana, A new operation on words suggested by DNA biochemistry: Hairpin completion, in: Proc. Transgressive Computing, 2006, pp. 216–228] with motivations coming from DNA biochemistry and hairpin reduction as the inverse operation of the hairpin completion. Both operations are viewed here...
متن کاملApplications of some Graph Operations in Computing some Invariants of Chemical Graphs
In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001